Dominance in a Cayley digraph and in its reverse
نویسندگان
چکیده
Let D be a digraph. Its reverse digraph, D−1, is obtained by reversing all arcs of D. We show that the domination numbers of D and D−1 can be different if D is a Cayley digraph. The smallest groups admitting Cayley digraphs with this property are the alternating group A4 and the dihedral group D6, both on 12 elements. Then, for each n ≥ 6 we find a Cayley digraph D on the dihedral group Dn such that the domination numbers of D and D−1 are different, though D has an efficient dominating set. Analogous results are also obtained for the total domination number.
منابع مشابه
Comparing a Cayley Digraph with Its Reverse
A Cayley digraph G = C(Γ, X) for a group Γ and a generating set X is the digraph with vertex set V (G) = Γ and arcs (g, gx) where g ∈ Γ and x ∈ X. The reverse of C(Γ, X) is the Cayley digraph G−1 = C(Γ, X−1) where X−1 = {x−1;x ∈ X}. We are interested in sufficient conditions for a Cayley digraph not to be isomorphic to its reverse and focus on Cayley digraphs of metacyclic groups with small gen...
متن کاملOptimal extensions and quotients of 2-Cayley Digraphs
Given a finite Abelian group G and a generator subset A ⊂ G of cardinality two, we consider the Cayley digraph Γ = Cay(G, A). This digraph is called 2–Cayley digraph. An extension of Γ is a 2–Cayley digraph, Γ′ = Cay(G′, A) with G < G′, such that there is some subgroup H < G′ satisfying the digraph isomorphism Cay(G′/H, A) ∼= Cay(G, A). We also call the digraph Γ a quotient of Γ′. Notice that t...
متن کاملDihedral Butterfly Digraph and Its Cayley Graph Representation
In this paper, we present a new extension of the butterfly digraph, which is known as one of the topologies used for interconnection networks. The butterfly digraph was previously generalized from binary to d-ary. We define a new digraph by adding a signed label to each vertex of the d-ary butterfly digraph. We call this digraph the dihedral butterfly digraph and study its properties. Furthermo...
متن کاملA Class of Cayley Digraph Structures Induced by Groups
In this paper we introduce the Cayley digraph structure. This can be considered as a generalization of Cayley digraph. We prove that all Cayley digraph structures are vertex transitive. Many graph theoretic properties are studied in terms of algebraic properties.
متن کاملOn the Characteristic Polynomial of n-Cayley Digraphs
A digraph Γ is called n-Cayley digraph over a group G, if there exists a semiregular subgroup RG of Aut(Γ) isomorphic to G with n orbits. In this paper, we represent the adjacency matrix of Γ as a diagonal block matrix in terms of irreducible representations of G and determine its characteristic polynomial. As corollaries of this result we find: the spectrum of semi-Cayley graphs over abelian g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 65 شماره
صفحات -
تاریخ انتشار 2016